Simultaneous Dempster-Shafer clustering and gradual determination of number of clusters using a neural network structure

نویسنده

  • Johan Schubert
چکیده

number of clusters. This was based on the final clustering In this paper we extend an earlier result within DempsterShafer theory [“Fast Dempster-Shafer Clustering Using a Neural Network Structure,” in Proc. Seventh Int. Conf. Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU’98)] where several pieces of evidence were clustered into a fixed number of clusters using a neural structure. This was done by minimizing a metaconflict function. We now develop a method for simultaneous clustering and determination of number of clusters during iteration in the neural structure. We let the output signals of neurons represent the degree to which a pieces of evidence belong to a corresponding cluster. From these we derive a probability distribution regarding the number of clusters, which gradually during the iteration is transformed into a determination of number of clusters. This gradual determination is fed back into the neural structure at each iteration to influence the clustering process.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Dempster-Shafer clustering using a neural network structure

In this paper we study a problem within Dempster-Shafer theory where 2n − 1 pieces of evidence are clustered by a neural structure into n clusters. The clustering is done by minimizing a metaconflict function. Previously we developed a method based on iterative optimization. However, for large scale problems we need a method with lower computational complexity. The neural structure was found to...

متن کامل

Dempster-Shafer clustering using Potts spin mean field theory

In this article we investigate a problem within Dempster±Shafer theory where 2 q À 1 pieces of evidence are clustered into q clusters by minimizing a metacon¯ict function, or equivalently, by minimizing the sum of weight of con¯ict over all clusters. Previously one of us developed a method based on a Hop®eld and Tank model. However, for very large problems we need a method with lower computatio...

متن کامل

REGION MERGING STRATEGY FOR BRAIN MRI SEGMENTATION USING DEMPSTER-SHAFER THEORY

Detection of brain tissues using magnetic resonance imaging (MRI) is an active and challenging research area in computational neuroscience. Brain MRI artifacts lead to an uncertainty in pixel values. Therefore, brain MRI segmentation is a complicated concern which is tackled by a novel data fusion approach. The proposed algorithm has two main steps. In the first step the brain MRI is divided to...

متن کامل

Comparing Bivariate and Multivariate Methods in Landslide Sustainability Mapping: A Case Study of Chelchay Watershed

1- INTRODUCTION In the last decades, due to human interventions and the effect of natural factors, the occurrence of landslide increased especially in the north of Iran, where the amount of rainfall is suitable for the landslide occurrence. In order to manage and mitigate the damages caused by landslide, the potential landslide-prone areas should be identified. In landslide susceptibili...

متن کامل

A neural network and iterative optimization hybrid for Dempster-Shafer clustering

In this paper we extend an earlier result within Dempster-Shafer theory [“Fast DempsterShafer Clustering Using a Neural Network Structure,” in Proc. Seventh Int. Conf. Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU’98)] where a large number of pieces of evidence are clustered into subsets by a neural network structure. The clustering is done by minimizing ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره cs.AI/0305025  شماره 

صفحات  -

تاریخ انتشار 1999